1.2 KB · ⤓ Micron 1.2 KB · ⤓ HTML 30.4 KB

top

The sub-group hiding assumption is a computational hardness assumption used in elliptic curve cryptography and pairing-based cryptography.

It was first introduced incite-ref-1[1] to build a 2-DNF homomorphic encryption scheme.

• See also

• References

• Non-interactive zero-knowledge proof

cite-note-11. ↑ Dan Boneh, Eu-Jin Goh, Kobbi Nissim: Evaluating 2-DNF Formulas on Ciphertexts. TCC 2005: 325–341